Genetically optimized Fuzzy C-means data clustering of IoMT-based biomarkers for fast affective state recognition in intelligent edge analytics
نویسندگان
چکیده
IoMT sensors such as wearables, moodables, ingestible and trackers have the potential to provide a proactive approach healthcare. But grouping, traversing selectively tapping data traffic its immediacy makes management & decision analysis pressing issue. Evidently, selection process for real-world, time-constrained health problems involves looking at multivariate time-series generated simultaneously from various wearables resulting in overload accuracy issues. Computational intelligence of edge analytics can extend predictive capability by quickly turning digital biomarker into actions remote monitoring trigger alarm during emergency incidents without relying on backend servers. pervasive generation streams levies significant issues visualization exploratory analysis. This paper presents genetically optimized Fuzzy C-means clustering technique affective state recognition edge. Clustering segregates chunks generates summarized each subject which is then avoid stagnation local optima. A multi-level convolution neural network finally used classify states baseline, stress amusement categories. The model evaluated publicly available WESAD dataset compares favorably state-of-the-art with less time complexity. It demonstrates use numerosity reduction real-time intelligent facilitates fast user.
منابع مشابه
A Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data
The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...
متن کاملBilateral Weighted Fuzzy C-Means Clustering
Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some k...
متن کاملFuzzy c-means clustering of incomplete data
The problem of clustering a real s-dimensional data set X={x(1 ),,,,,x(n)} subset R(s) is considered. Usually, each observation (or datum) consists of numerical values for all s features (such as height, length, etc.), but sometimes data sets can contain vectors that are missing one or more of the feature values. For example, a particular datum x(k) might be incomplete, having the form x(k)=(25...
متن کاملOPTIMIZATION OF FUZZY CLUSTERING CRITERIA BY A HYBRID PSO AND FUZZY C-MEANS CLUSTERING ALGORITHM
This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...
متن کاملPossibility Fuzzy C-means Clustering for Expression Invariant Face Recognition
Face being the most natural method of identification for humans is one of the most significant biometric modalities and various methods to achieve efficient face recognition have been proposed. However the changes in face owing to different expressions, pose, makeup, illumination, age bring about marked variations in the facial image. These changes will inevitably occur and they can be controll...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Soft Computing
سال: 2021
ISSN: ['1568-4946', '1872-9681']
DOI: https://doi.org/10.1016/j.asoc.2021.107525